On base-cover metacompact products

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A note on monotonically metacompact spaces

Article history: Received 17 July 2008 Received in revised form 6 October 2009 MSC: primary 54D20 secondary 54E30, 54E35, 54F05

متن کامل

On Base Partitions and Cover Partitions of Skew Characters

In this paper we give an easy combinatorial description for the base partition B of a skew character [A], which is the intersection of all partitions α whose corresponding character [α] appears in [A]. This we use to construct the cover partition C for the ordinary outer product as well as for the Schubert product of two characters and for some skew characters, here the cover partition is the u...

متن کامل

On the k-path vertex cover of some graph products

A subset S of vertices of a graph G is called a k-path vertex cover if every path of order k in G contains at least one vertex from S. Denote by ψk(G) the minimum cardinality of a k-path vertex cover in G. In this paper improved lower and upper bounds for ψk of the Cartesian and the direct product of paths are derived. It is shown that for ψ3 those bounds are tight. For the lexicographic produc...

متن کامل

Compact Monotonically Metacompact Spaces Are Metrizable

Monotonically metacompact spaces were recently introduced as an extension of the concept of monotonically compact spaces. In this note we answer a question of Popvassilev, and Bennett, Hart, and Lutzer, by showing that every compact, Hausdorff, monotonically (countably) metacompact space is metrizable. We also show that certain countable spaces fail to be monotonically (countably) metacompact.

متن کامل

Cover Pebbling Cycles and Certain Graph Products

A pebbling step on a graph consists of removing two pebbles from one vertex and placing one pebble on an adjacent vertex. A graph is said to be cover pebbled if every vertex has a pebble on it after a series of pebbling steps. The cover pebbling number of a graph is the minimum number of pebbles such that the graph can be cover pebbled, no matter how the pebbles are initially placed on the vert...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Topology and its Applications

سال: 2010

ISSN: 0166-8641

DOI: 10.1016/j.topol.2010.07.035